منابع مشابه
Modeling of Partial Digest Problem as a Network flows problem
Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...
متن کاملOn continuous network flows
This work addresses two problems concerning continuous dynamic flows. A model is presented for a network that incorporates continuous time-varying flows, link capacities, node storage capacities, as well as time dependent link delays. It is an enhancement of previous results which do not incorporate time varying link delays. We present a generalized min-cut max-flow theorem for that model. A se...
متن کاملA bi-projection method for Bingham type flows
We propose and study a new numerical scheme to compute the isothermal and unsteady flow of an incompressible viscoplastic Bingham medium. The main difficulty, for both theoretical and numerical approaches, is due to the non-differentiability of the plastic part of stress tensor in regions where the rate-of-strain tensor vanishes. This is handled by reformulating the definition of the plastic st...
متن کاملA possibilistic bi-objective model for a competitive supply chain network design under variable coverage
In this paper, the strategic planning of a supply chain under a static chain-to-chain competition on the plane is addressed. It is assumed that each retailer has a coverage area called the radius of influence. The demand of each demand zone is divided equally between the retailers which can cover that market. However, the demand of distant customers who are not in the retailers’ radius of influ...
متن کاملGeneralizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of efficient constraint propagation algorithms for problem solving. Many of the most common global constraints used in constraint programming use filtering algorithms based on network flow theory. We show how we can form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hokkaido Mathematical Journal
سال: 2015
ISSN: 0385-4035
DOI: 10.14492/hokmj/1470053291